Parallel repetition of XOR games
ثبت نشده
چکیده
منابع مشابه
Strong Parallel Repetition Theorem for Quantum XOR Proof Systems
We consider a class of two-prover interactive proof systems where each prover returns a single bit to the verifier and the verifier’s verdict is a function of the XOR of the two bits received. Such proof systems, called XOR proof systems, have previously been shown to characterize MIP (= NEXP) in the case of classical provers but to reside in EXP in the case of quantum provers (who are allowed ...
متن کاملProduct Rules in Semidefinite Programming
In recent years we witness the proliferation of semidefinite programming bounds in combinatorial optimization [1,5,8], quantum computing [9,2,3,6,4] and even in complexity theory [7]. Examples to such bounds include the semidefinite relaxation for the maximal cut problem [5], and the quantum value of multi-prover interactive games [3,4]. The first semidefinite programming bound, which gained fa...
متن کاملOn the Parallel Repetition of Multi-Player Games: The No-Signaling Case
We consider the natural extension of two-player nonlocal games to an arbitrary number of players. An important question for such nonlocal games is their behavior under parallel repetition. For two-player nonlocal games, it is known that both the classical and the non-signaling value of any game converges to zero exponentially fast under parallel repetition, given that the game is non-trivial to...
متن کاملMultiplayer Parallel Repetition for Expanding Games
We investigate the value of parallel repetition of one-round games with any number of players k ≥ 2. It has been an open question whether an analogue of Raz’s Parallel Repetition Theorem holds for games with more than two players, i.e., whether the value of the repeated game decays exponentially with the number of repetitions. Verbitsky has shown, via a reduction to the density Hales-Jewett the...
متن کاملStrong parallel repetition for free entangled games, with any number of players
We present a strong parallel repetition theorem for the entangled value of multi-player, oneround free games (games where the inputs come from a product distribution). Our result is the first parallel repetition theorem for entangled games involving more than two players. Furthermore, our theorem applies to games where the players are allowed to output (possibly entangled) quantum states as ans...
متن کامل